Modified Rockafellar’s algorithms
نویسنده
چکیده
In this paper, proximal point algorithms for nonexpansive (sequences of nonexpansive) maps and maximal monotone operators are studied. A modification of Xu’s algorithm is given and a strong convergence result associated with it is proved when the error sequence is in `p for 1 ≤ p < 2. We also propose some other modifications of the celebrated Rockafellar’s algorithm which generate weak or strong convergent sequences.
منابع مشابه
Iteration-complexity of a Rockafellar’s proximal method of multipliers for convex programming based on second-order approximations
This paper studies the iteration-complexity of a new primal-dual algorithm based on Rockafellar’s proximal method of multipliers (PMM) for solving smooth convex programming problems with inequality constraints. In each step, either a step of Rockafellar’s PMM for a second-order model of the problem is computed or a relaxed extragradient step is performed. The resulting algorithm is a (large-ste...
متن کاملFitzpatrick functions, cyclic monotonicity and Rockafellar’s antiderivative
Several deeper results on maximal monotone operators have recently found simpler proofs using Fitzpatrick functions. In this paper, we study a sequence of Fitzpatrick functions associated with a monotone operator. The first term of this sequence coincides with the original Fitzpatrick function, and the other terms turn out to be useful for the identification and characterization of cyclic monot...
متن کاملMaximality of the sum of a maximally monotone linear relation and a maximally monotone operator Dedicated to Petar Kenderov on the occasion of his seventieth birthday
The most famous open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar’s constraint qualification holds. In this paper, we prove the maximal monotonicity of A+B provided that A,B are maximally monotone and A is a linear relation, as soon as Rockafellar’s constraint qualification holds: domA ∩ int domB 6...
متن کاملPrimal-dual regularized SQP and SQCQP type methods for convex programming and their complexity analysis
This paper presents and studies the iteration-complexity of two new inexact variants of Rockafellar’s proximal method of multipliers (PMM) for solving convex programming (CP) problems with a finite number of functional inequality constraints. In contrast to the first variant which solves convex quadratic programming (QP) subproblems at every iteration, the second one solves convex constrained q...
متن کاملSum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem
In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.
متن کامل